Recent results on combinatorial constructions for threshold schemes

A perfect (t, w, v; m)-threshold scheme is a type of combinatorial design that provides a way of distributing partial information (chosen from a set of v points called shadows) to w participants, so that any t of them can easily calculate one of m possible keys, but no subset of fewer than t participants can determine any partial information regarding the key. In this paper, we give a survey of recent constructions for perfect (t, w, v; m)-threshold schemes. In particular, we update results concerning perfect (3, 3, v; m)-threshold schemes. 1.